Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x) → s(x)
f(s(s(x))) → s(f(f(x)))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x) → s(x)
f(s(s(x))) → s(f(f(x)))
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:
f1 > s1
and weight map:
dummyConstant=1
s_1=1
f_1=1